Generating feasible schedules for a pick-up and delivery problem
Identifieur interne : 00A379 ( Main/Exploration ); précédent : 00A378; suivant : 00A380Generating feasible schedules for a pick-up and delivery problem
Auteurs : Eric Domenjoud ; Claude Kirchner ; Jianyang ZhouSource :
- Electronic Notes in Discrete Mathematics ; 1999.
English descriptors
Abstract
In this research, we study a transportation problem that involves vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers. Its solution involves planning itineraries for buses and establishing working schedule for drivers,subject to vehicle capacity limitation and time constraints. The objective is to efficiently schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model and a solution method for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations regardless of different vehicle routes. This provides a global planning over all routes and plays an important role in the solution method. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests. Based on this constraint model, efficient reactive planning and optimization algorithms are constructed to generate feasible schedules for the problem.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002857
- to stream Crin, to step Curation: 002857
- to stream Crin, to step Checkpoint: 001C46
- to stream Main, to step Merge: 00AA47
- to stream Main, to step Curation: 00A379
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" wicri:score="-9">Generating feasible schedules for a pick-up and delivery problem</title></titleStmt><publicationStmt><idno type="RBID">CRIN:domenjoud99a</idno><date when="1999" year="1999">1999</date><idno type="wicri:Area/Crin/Corpus">002857</idno><idno type="wicri:Area/Crin/Curation">002857</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002857</idno><idno type="wicri:Area/Crin/Checkpoint">001C46</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001C46</idno><idno type="wicri:Area/Main/Merge">00AA47</idno><idno type="wicri:Area/Main/Curation">00A379</idno><idno type="wicri:Area/Main/Exploration">00A379</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Generating feasible schedules for a pick-up and delivery problem</title><author><name sortKey="Domenjoud, Eric" sort="Domenjoud, Eric" uniqKey="Domenjoud E" first="Eric" last="Domenjoud">Eric Domenjoud</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author><author><name sortKey="Zhou, Jianyang" sort="Zhou, Jianyang" uniqKey="Zhou J" first="Jianyang" last="Zhou">Jianyang Zhou</name></author></analytic><series><title level="j">Electronic Notes in Discrete Mathematics</title><imprint><date when="1999" type="published">1999</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>constraint propagation</term><term>pick-up and delivery</term><term>planning</term><term>scheduling</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2734">In this research, we study a transportation problem that involves vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers. Its solution involves planning itineraries for buses and establishing working schedule for drivers,subject to vehicle capacity limitation and time constraints. The objective is to efficiently schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model and a solution method for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations regardless of different vehicle routes. This provides a global planning over all routes and plays an important role in the solution method. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests. Based on this constraint model, efficient reactive planning and optimization algorithms are constructed to generate feasible schedules for the problem.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Domenjoud, Eric" sort="Domenjoud, Eric" uniqKey="Domenjoud E" first="Eric" last="Domenjoud">Eric Domenjoud</name><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><name sortKey="Zhou, Jianyang" sort="Zhou, Jianyang" uniqKey="Zhou J" first="Jianyang" last="Zhou">Jianyang Zhou</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A379 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00A379 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:domenjoud99a
|texte= Generating feasible schedules for a pick-up and delivery problem
}}
| This area was generated with Dilib version V0.6.33. |  |